Competitive Online Routing on Delaunay Triangulations
نویسندگان
چکیده
منابع مشابه
Competitive Online Routing on Delaunay Triangulations
Let G be a graph, s ∈ G be a source node and t ∈ G be a target node. The sequence of adjacent nodes (graph walk) visited by a routing algorithm is a c-competitive route if its length in G is at most c times the length of the shortest path from s to t in G. We present 21.766-, 17.982and 15.479-competitive online routing algorithms on the Delaunay triangulation of an arbitrary given set of points...
متن کاملUpper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routing algorithm on G has a competitive ratio of c if the length of the path produced by the algorithm from any vertex s to any vertex t is at most c times the length of the shortest path from s to t in G. If the length o...
متن کاملUpper and Lower Bounds for Online Routing on Delaunay Triangulations
Consider a weighted graph G whose vertices are points in the plane and edges are line segments between pairs of points whose weight is the Euclidean distance between its endpoints. A routing algorithm on G sends a message from any vertex s to any vertex t in G. The algorithm has a competitive ratio of c if the length of the path taken by the message is at most c times the length of the shortest...
متن کاملOnline Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorithms, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless algorithm that works for all triangulations, (3) an O(1) memory algorithm that w...
متن کاملMorphological Operations on Delaunay Triangulations
Algorithms are presented which allow to perform morphological transformations on unorganised sets of points represented by their Delaunay triangulation. The results show that these algorithms could behaves as morphological operators such as erosion, dilatation, opening do. As a matter of fact, they actually act as “shape filter”. These algorithms are applied to the problem of scene reconstructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2017
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195917500066